منابع مشابه
The Inducibility of Graphs on Four Vertices
We consider the problem of determining the maximum induced density of a graph H in any graph on n vertices. The limit of this density as n tends to infinity is called the inducibility of H . The exact value of this quantity is known only for a handful of small graphs and a specific set of complete multipartite graphs. Answering questions of Brown-Sidorenko and Exoo we determine the inducibility...
متن کاملGraphs with Four Boundary Vertices
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give a full description of all graphs that have exactly four boundary vertices, which answers a question of Hasegawa and Saito. To this end, we introduce the concept of frame of a graph. It allows us to construct, for every pos...
متن کاملan investigation on influencing factors on tourists shopping attitude of iranian handmade carpet in isfahan
چکیده ندارد.
15 صفحه اولan investigation of the impact of self monitoring on langauge teachers motivational practice and its effect on learners motivation
the central purpose of this study was to conduct a case study about the role of self monitoring in teacher’s use of motivational strategies. furthermore it focused on how these strategies affected students’ motivational behavior. although many studies have been done to investigate teachers’ motivational strategies use (cheng & d?rnyei, 2007; d?rnyei & csizer, 1998; green, 2001, guilloteaux & d?...
An Algorithm for Computing Four-Ramond Vertices at Arbitrary Level
We perform the sewing of two (dual) Ramond reggeon vertices and derive an algorithm by means of which the so obtained four-Ramond reggeon vertex may be explicitly computed at arbitrary oscillator (mass) level. A closed form of the four-vertex is then deduced on the basis of a comparison to all terms obtained by sewing that contain only level zero and one oscillators. Results are presented for b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky a fysiky
سال: 1935
ISSN: 1802-114X
DOI: 10.21136/cpmf.1935.123587